package Queue;

public class LoopQueue {
    private int[] elem;
    private int front;
    private int rear;

    public LoopQueue(int x) {
        elem = new int[x+1];
    }

    public boolean enQueue(int val) {
        if(isFull()) {
            return false;
        }
        elem[rear] = val;
        rear = (rear+1)%elem.length;
        return true;
    }

    public boolean deQueue() {
        if(isEmpty()){
            return false;
        }
        front = (front+1)%elem.length;
        return true;
    }

    public int Front() {
        if(isEmpty()) {
            return -1;
        }
        return elem[front];
    }

    public int Rear() {
        if(isEmpty()) {
            return -1;
        }
        int index = (rear==0) ? elem.length-1 : rear-1;
        return elem[index];
    }

    public boolean isEmpty() {
        return front == rear;
    }

    public boolean isFull() {
        if((rear+1)% elem.length == front) {
            return true;
        }
        return false;
    }

}
